A Universal Model for Non-Procedural Database Languages
نویسنده
چکیده
We propose a language which can express every computable query. The language is syntactically based on the first-order predicate calculus, but semantically is interpreted as post-conditions, unlike the customary calculus query languages. The language has a capability to restrict itself to reasonable queries, accepting criteria of reasonability as a parameter.
منابع مشابه
Set Comparison in Relational Query Languages
Today’s de facto database standard, the relational database, was conceived in the late 1960’s by Edgar F. Codd at IBM. The relational data model offered the user a logical view of the data that was shielded from consideration of how the data would, in fact, be physically organized in storage. This feat was accomplished in large part by the introduction of relational query languages that would s...
متن کاملSALIERI: A General, Interactive Computer Music System
In this paper we describe the Salieri System, an interactive software environment for structure oriented composition, manipulation, and analysis of music. The system is built on the newly developed Salieri Language, a universal programming language based on a hierarchical model of formal music representation, combining features of traditional functional and procedural programming languages with...
متن کاملXVM - A Hybrid Sequential-Query Virtual Machine for Processing XML Languages
As XML establishes itself as a universal data model for data exchange and presentation, a number of high-level declarative languages, such as XPath, XQuery, XQueryP, XSLT, have been proposed to effectively query, transform and manipulate the XML data. There have been considerable efforts, both in academic and industry communities of providing optimization and efficient implementation of these l...
متن کاملTeaching Relational Algebra and Relational Calculus: A Programming Approach
This paper describes how relational algebra and relational calculus can be taught using a programming approach. This is in contrast to the mathematical presentation of these topics in most database textbooks. For relational algebra, a function library implemented with Visual FoxPro allows queries to be written as a sequence of function calls--one call per relational algebra operation. For relat...
متن کاملLearning Regular Languages via Alternating Automata
Nearly all algorithms for learning an unknown regular language, in particular the popular L∗ algorithm, yield deterministic finite automata. It was recently shown that the ideas of L∗ can be extended to yield non-deterministic automata, and that the respective learning algorithm, NL∗, outperforms L∗ on randomly generated regular expressions. We conjectured that this is due to the existential na...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Fundam. Inform.
دوره 26 شماره
صفحات -
تاریخ انتشار 1996